5-Chromatic even triangulations on surfaces
نویسنده
چکیده
A triangulation is said to be even if each vertex has even degree. It is known that every even triangulation on any orientable surface with sufficiently large representativity is 4-colorable [J. Hutchinson, B. Richter, P. Seymour, Colouring Eulerian triangulations, J. Combin. Theory, Ser. B 84 (2002) 225–239], but all graphs on any surface with large representativity are 5-colorable [C. Thomassen, Five-coloring maps on surfaces, J. Combin Theory Ser. B 59 (1993) 89–105]. In this paper, we shall characterize 5-chromatic even triangulations with large representativity, which appear only on nonorientable surfaces. © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Four-coloring Six-regular Graphs on the Torus
A classic 3-color theorem attributed to Heawood [10, 11] (also observed by Kempe [16]) states that every even triangulation of the plane is 3-chromatic; by even we mean that every vertex has even degree. We are interested in the extent to which an analogous theorem carries over to even triangulations of the torus and to other surfaces of larger genus. In general, even triangulations of the toru...
متن کامل5-Chromatic even triangulations on the Klein bottle
It is known that for any closed surface F 2, every embedding on F 2 with sufficiently large representativity is 5-colorable. In this paper, we shall characterize the 5-chromatic even triangulations on the Klein bottle with high representativity. © 2005 Elsevier B.V. All rights reserved.
متن کاملColoring-flow Duality of Embedded Graphs
Let G be a directed graph embedded in a surface. A map φ : E(G) → R is a tension if for every circuit C ⊆ G, the sum of φ on the forward edges of C is equal to the sum of φ on the backward edges of C. If this condition is satisfied for every circuit of G which is a contractible curve in the surface, then φ is a local tension. If 1 ≤ |φ(e)| ≤ α − 1 holds for every e ∈ E(G), we say that φ is a (l...
متن کاملPlanar triangulations which quadrangulate other surfaces
We shall show that for any closed surface F2 except the sphere, there is a triangulation on the sphere which can be embedded on F2 as a quadrangulation, and characterize those 5-connected triangulations on the sphere that quadrangulate other closed surfaces, discussing double 4-cycle covers of triangulations. © 2004 Published by Elsevier Ltd
متن کاملThe largest real zero of the chromatic polynomial
It is proved that if every subcontraction of a graph G contains a vertex with degree at most k, then the chromatic polynomial of G is positive throughout the interval (k, c~); Kk+l shows that this interval is the largest possible. It is conjectured that the largest real zero of the chromatic polynomial of a z-chromatic planar graph is always less than X. For Z = 2 and 3, constructions are given...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008